package inClass;

import java.util.Stack;

//https://leetcode.cn/problems/binary-tree-preorder-traversal/description/
public class t1 {

    public static void main(String[] args) {
        Stack<Integer> s = new Stack<>();
        s.push(1);
        s.pop();
        while(!s.isEmpty()) {

        }
    }
}
